例句與造句

1. A novel algorithm and its convergence for a class of combinatorial optimization problems
   一類組合優(yōu)化問題的新解法及其收斂性
2. This paper studies the approximation algorithms of some combinatorial optimization problems
   本文主要研究組合優(yōu)化中若干問題的近似算法。
3. In addition , simulated annealing algorithm for the combinatorial optimization problem here is also given
   此外，利用模擬退火算法成功地解決了該組合優(yōu)化問題。
4. Packing problems are categorized as discrete combinatorial optimization problems with np - complete computational complexities
   布局問題是具有np完備計(jì)算復(fù)雜度的離散組合優(yōu)化問題。
5. Grouping problem is combinatorial optimization problem which is effective to solve by genetic algorithm
   成組技術(shù)問題是組合優(yōu)化問題,而遺傳算法正是目前求解組合最優(yōu)化的有效方法之一。
6. It's difficult to find combinatorial optimization problem in a sentence. 用combinatorial optimization problem造句挺難的
7. The cast grouping and ordering problem of steelmaking continuous casting hot rolling ( sm - cc ) is a combinatorial optimization problem
   摘要煉鋼-連鑄生產(chǎn)的澆次組合與排序是帶有工藝約束的并行機(jī)流水車間調(diào)度問題。
8. The optimization of gear parameters in designing movements of clocks and watches is a combinatorial optimization problem . it is difficult to solve the problem
   鐘手表機(jī)芯設(shè)計(jì)中齒輪參數(shù)的優(yōu)化設(shè)計(jì)問題是一個(gè)組合優(yōu)化問題,很難用傳統(tǒng)優(yōu)化方法解決。
9. Scheduling is one kind of important combinatorial optimization problem , which use some processors , machines or resources to accomplish optimally a batch of given tasks or jobs
   排序問題研究的是若干個(gè)任務(wù)要在一些機(jī)器上進(jìn)行加工，如何安排機(jī)器和任務(wù)使得某些要求(目標(biāo)函數(shù))達(dá)到最優(yōu)的問題。
10. Recently , genetic algorithm has been tyied to resolve variable combinatorial optimization problems , such as job scheduling problem , but but has began just now in vsp
    近些年來，人們?cè)谟眠z傳算法解決現(xiàn)實(shí)中的各種組合優(yōu)化問題上進(jìn)行了探索，如在生產(chǎn)調(diào)度問題中的應(yīng)用，但在車輛調(diào)度問題中的應(yīng)用才剛剛開始。
11. In the rest of the thesis , we study approximation algorithms with their worst - case analysis for four different combinatorial optimization problems . in chapter 2 , we consider the optimization versions of the 3 - partitioning and the kernel 3 - partitioning problems
    在第二章至第五章中，我們分別研究了四個(gè)組合優(yōu)化問題的近似算法，并給出了它們的性能分析。
12. Ant colony optimization ( aco ) algorithm is a nature - inspired metaheuristic algorithm . it has experienced more than 10 years ’ development since it was proposed and has become an efficient tool for solving combinatorial optimization problem
    蟻群優(yōu)化算法是一種基于自然啟發(fā)的metaheuristic算法,從其提出到現(xiàn)在歷經(jīng)10多年的發(fā)展到目前已經(jīng)成為一種解決組合優(yōu)化問題的有效工具。
13. Dp technique is a high efficiency algorithm to solve combinatorial optimization problems by divided the multidimensional problem into multiple 1 - dimension problems . when this technique resorts to accumulate multiple frames , there are some disadvantages
    動(dòng)態(tài)規(guī)劃算法是一種解決組合尋優(yōu)問題的高效算法,通過將n維問題變換為n個(gè)一維優(yōu)化問題,一個(gè)一個(gè)地求解的方法,很好的提高了效率。
14. The maximum clique problem ( mcp ) is a classical combinatorial optimization problem which belongs to np - hard , and many practical problems can be formulated to it . therefore , studying the mcp is full of significance both in theory and in practice
    最大團(tuán)問題是一個(gè)經(jīng)典的np難的組合優(yōu)化問題,很多實(shí)際問題都可以抽象為對(duì)無向圖上最大團(tuán)問題的求解,所以,對(duì)最大團(tuán)問題的研究無論在理論上還是實(shí)際上都有重要意義。
15. To solve the combinatorial optimization problem of outer layout and inner connection integrated schemes in the design of hydraulic manifold blocks ( hmb ) , an intelligent virtual design method was proposed with combining modern intelligent optimization methods with virtual design technology
    摘要為解決液壓集成塊設(shè)計(jì)中外部布局和內(nèi)部布孔集成的組合優(yōu)化問題，提出了一種融合現(xiàn)代智能優(yōu)化方法和虛擬設(shè)計(jì)技術(shù)的智能虛擬設(shè)計(jì)方法。
16. Ant colony algorithm is a novel simulated evolutionary algorithm , which is used to solve the optimization problems through simulating the way of ants finding the shortest path for food . this algorithm has been applied successfully to combinatorial optimization problems such as traveling salesman problem
    蟻群算法是一種新型的模擬進(jìn)化算法，它通過模擬蟻群在覓食過程中尋找最短路徑的方法來求解優(yōu)化問題，目前在旅行商問題等組合優(yōu)化問題中有成功的應(yīng)用。
更多例句：  下一頁